A Hybrid Algorithm for Job Shop Scheduling Problem
نویسندگان
چکیده
منابع مشابه
A Hybrid Algorithm for Job Shop Scheduling Problem
The Job Shop Scheduling Problem (JSSP) is regarded as one of the most challenging issues by the research community in this field due to its complexity. This paper presents a hybrid algorithm called H-PSO-SA for JSSP which is a mixture of two computational artificial intelligence algorithms: Particle Swarm Optimization and Simulated Annealing. In order to demonstrate efficiency of the proposed h...
متن کاملAn algorithm for multi-objective job shop scheduling problem
Scheduling for job shop is very important in both fields of production management and combinatorial op-timization. However, it is quite difficult to achieve an optimal solution to this problem with traditional opti-mization approaches owing to the high computational complexity. The combination of several optimization criteria induces additional complexity and new problems. In this paper, we pro...
متن کاملAn Effective Hybrid Genetic Algorithm for Job Shop Scheduling Problem
The job shop scheduling problem (JSSP) is well known as one of the most difficult combinatorial optimization problems. This paper presents a hybrid genetic algorithm for the JSSP with the objective of minimizing makespan. The efficiency of the genetic algorithm is enhanced by integrating it with a local search method. The chromosome representation of the problem is based on operations. Schedule...
متن کاملAn Improved Tabu Search Algorithm for Job Shop Scheduling Problem Trough Hybrid Solution Representations
Job shop scheduling problem (JSP) is an attractive field for researchers and production managers since it is a famous problem in many industries and a complex problem for researchers. Due to NP-hardness property of this problem, many meta-heuristics are developed to solve it. Solution representation (solution seed) is an important element for any meta-heuristic algorithm. Therefore, many resear...
متن کاملan algorithm for multi-objective job shop scheduling problem
scheduling for job shop is very important in both fields of production management and combinatorial op-timization. however, it is quite difficult to achieve an optimal solution to this problem with traditional opti-mization approaches owing to the high computational complexity. the combination of several optimization criteria induces additional complexity and new problems. in this paper, we pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Studies in Informatics and Control
سال: 2015
ISSN: 1220-1766,1841-429X
DOI: 10.24846/v24i2y201505